Partitioning Generic Graphs into K Balanced Subgraphs
نویسندگان
چکیده
Graph partitioning is a classical graph theory problem that has proven to be NP-hard. Most of the research in literature has focused its attention on a particular case of the problem called the graph bisection problem, where k = 2, such that the parts have approximately equal weight and minimizing the size of the edge cut. In this article, we describe how to obtain balanced partitioning on a given undirected, connected and weighted graph into an arbitrary number k of regions (subgraphs), by hierarchically employing a multilevel bisection algorithm not only in the general graph, but also in the originated subgraphs. Due to the application chosen for this study, the partition consists of k subgraphs, which are subsets of vertices in the same region, not intended to be totally disjoint, sharing at least one vertex with another subgraph near their borders.
منابع مشابه
Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs
Given a graph and a positive integer k, the biclique vertex-partition problem asks whether the vertex set of the graph can be partitioned into at most k bicliques (connected complete bipartite subgraphs). It is known that this problem is NP-complete for bipartite graphs. In this paper we investigate the computational complexity of this problem in special subclasses of bipartite graphs. We prove...
متن کاملPartitioning Harary graphs into connected subgraphs containing prescribed vertices
A graph G is arbitrarily partitionable (AP for short) if for every partition (n1, n2, ..., np) of |V (G)| there exists a partition (V1, V2, ..., Vp) of V (G) such that each Vi induces a connected subgraph of G with order ni. If, additionally, k of these subgraphs (k ≤ p) each contains an arbitrary vertex of G prescribed beforehand, then G is arbitrarily partitionable under k prescriptions (AP+k...
متن کاملFast Balanced Partitioning Is Hard Even on Grids and Trees
Two kinds of approximation algorithms exist for the k-BALANCED PARTITIONING problem: those that are fast but compute unsatisfactory approximation ratios, and those that guarantee high quality ratios but are slow. In this article we prove that this tradeoff between running time and solution quality is unavoidable. For the problem a minimum number of edges in a graph need to be found that, when c...
متن کاملPartitioning the Edges of a Planar Graph into Two Partial K-Trees
In this paper we prove two results on partitioning the edges of a planar graph into two partial k-trees, for fixed values of k. Interest in this class of partitioning problems arises since many intractable graph and network problems admit polynomial time solutions on k-trees and their subgraphs (partial k-trees). The first result shows that every planar graph is a union of two partial 3-trees. ...
متن کاملSimultaneous well-balanced orientations of graphs
Nash-Williams’ well-balanced orientation theorem [11] is extended for orienting several graphs simultaneously. We prove that if G1, ..., Gk are pairwise edge-disjoint subgraphs of a graph G, then G has a well-balanced orientation ~ G such that the inherited orientations ~ Gi of Gi are well-balanced for all 1 ≤ i ≤ k. We also have new results about simultaneous well-balanced orientations of non-...
متن کامل